Book Embeddings of Posets
نویسنده
چکیده
We introduce a special type of graph embedding called book embedding and apply it to posets. A book embedding scheme for bipartite graphs is given, and is used to extend the embeddings to general k-partite graphs. Finally, we view the Hasse diagram of a poset as a directed k-partite graph and use this scheme to derive a book embedding for arbitrary posets. Using this book embedding scheme, we also find a bound on the book thickness of posets, which is a measure of the quality of a book embedding.
منابع مشابه
Order dense injectivity of $S$-posets
In this paper, the notion of injectivity with respect to order dense embeddings in the category of $S$-posets, posets with a monotone action of a pomonoid $S$ on them, is studied. We give a criterion, like the Baer condition for injectivity of modules, or Skornjakov criterion for injectivity of $S$-sets, for the order dense injectivity. Also, we consider such injectivit...
متن کاملOn the Möbius Function and Topology of General Pattern Posets
We introduce a formal definition of a pattern poset which encompasses several previously studied posets in the literature. Using this definition we present some general results on the Möbius function and topology of such pattern posets. We prove our results using a poset fibration based on the embeddings of the poset, where embeddings are representations of occurrences. We show that the Möbius ...
متن کاملLexicographic shellability of partial involutions
In this manuscript we study inclusion posets of Borel orbit closures on (symmetric) matrices. In particular, we show that the Bruhat poset of partial involutions is a lexicographically shellable poset. We determine which subintervals of the Bruhat posets are Eulerian, and moreover, by studying certain embeddings of the symmetric groups and their involutions into rook matrices and partial involu...
متن کاملWeak embeddings of posets to the Boolean lattice
The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into the Boolean lattice, or to a few consecutive levels of it, areNP-complete.
متن کاملOn Singular Stationarity I (Mutual Stationarity and Ideal-Based methods)
We study several ideal-based constructions in the context of singular stationarity. By combining methods of strong ideals, supercompact embeddings, and Prikry-type posets, we obtain three consistency results concerning mutually stationary sets, and answer a question of Foreman and Magidor ([7]) concerning stationary sequences on the first uncountable cardinals, אn, 1 ≤ n < ω.
متن کامل